Demonstration-Guided Motion Planning

نویسندگان

  • Gu Ye
  • Ron Alterovitz
چکیده

We present demonstration-guided motion planning (DGMP), a new framework for planning motions for personal robots to perform household tasks. DGMP combines the strengths of sampling-based motion planning and robot learning from demonstrations to generate plans that (1) avoid novel obstacles in cluttered environments, and (2) learn and maintain critical aspects of the motion required to successfully accomplish a task. Sampling-based motion planning methods are highly effective at computing paths from start to goal configurations that avoid obstacles, but task constraints (e.g. a glass of water must be held upright to avoid a spill) must be explicitly enumerated and programmed. Instead, we use a set of expert demonstrations and automatically extract time-dependent task constraints by learning low variance aspects of the demonstrations, which are correlated with the task constraints. We then introduce multi-component rapidly-exploring roadmaps (MCRRM), a sampling-based method that incrementally computes a motion plan that avoids obstacles and optimizes a learned cost metric. We demonstrate the effectiveness of DGMP using the Aldebaran Nao robot performing household tasks in a cluttered environment, including moving a spoon full of sugar from a bowl to a cup and cleaning the surface of a table.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exploiting Structure: A Guided Approach to Sampling-Based Robot Motion Planning

Exploiting Structure: A Guided Approach to Sampling-Based Robot Motion Planning

متن کامل

Towards Robust Skill Generalization: Unifying Learning from Demonstration and Motion Planning

In this paper, we present Combined Learning from demonstration And Motion Planning (CLAMP) as an efficient approach to skill learning and generalizable skill reproduction. CLAMP combines the strengths of Learning from Demonstration (LfD) and motion planning into a unifying framework. We carry out probabilistic inference to find trajectories which are optimal with respect to a given skill and al...

متن کامل

Experience Guided Mobile Manipulation Planning

The most critical moves that determine the success of a manipulation task are performed within the close vicinities of the object prior to grasping, and the goal prior to the final placement. Memorizing these state-action sequences and reusing them can dramatically improve the task efficiency, whereas even the state-of-the-art planning algorithms may require significant amount of time and compu...

متن کامل

Learning from a Single Demonstration: Motion Planning with Skill Segmentation

We propose an approach to control learning from demonstration that first segments demonstration trajectories to identify subgoals, then uses model-based control methods to sequentially reach these subgoals to solve the overall task. Using this approach, we show that a mobile robot is able to solve a combined navigation and manipulation task robustly after observing only a single successful traj...

متن کامل

Motion Planning With Differential Constraints as Guided Search Over Continuous and Discrete Spaces

To compute a motion trajectory that avoids collisions, reaches a goal region, and satisfies differential constraints imposed by robot dynamics, this paper proposes an approach that conducts a guided search over the continuous space of motions and over a discrete space obtained by a workspace decomposition. A tree of feasible motions and a frontier of workspace regions are expanded simultaneousl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011